Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
نویسندگان
چکیده
منابع مشابه
Sliced Wasserstein Barycenter of Multiple Densities
The optimal mass transportation problem provides a framework for interpolating between different probability density functions (pdfs), warping one function toward another. Interpolating between two arbitrary pdfs can be challenging, but interpolating between more than two pdfs just remains untractable. We propose an approximation of such interpolations based on 1D projections, that is efficient...
متن کاملWasserstein Barycenter and Its Application to Texture Mixing
This paper proposes a new definition of the averaging of discrete probability distributions as a barycenter over theWasserstein space. Replacing the Wasserstein original metric by a sliced approximation over 1D distributions allows us to use a fast stochastic gradient descent algorithm. This new notion of barycenter of probabilities is likely to find applications in computer vision where one wa...
متن کاملConsistent estimation of a population barycenter in the Wasserstein space
We define a notion of barycenter for random probability measures in the Wasserstein space. We study the population barycenter in terms of existence and uniqueness. Using a duality argument, we give a precise characterization of the population barycenter for compactly supported measures, and we make a connection between averaging in the Wasserstein space and taking the expectation of optimal tra...
متن کاملDynamic clustering of histograms using Wasserstein metric
In the present paper we present a new distance, based on the Wasserstein metric, in order to cluster a set of data described by distributions with finite continue support. The proposed distance allows to define a measure of inertia of data with respect a barycenter that satisfies the Huygens theorem of decomposition of inertia. Thus, this measure is proposed as allocation function in the dynami...
متن کاملFast Reconstruction of SAR Images with Phase Error Using Sparse Representation
In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2017
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2017.2659647